CSALF-Q: A Bricolage Algorithm for Anisotropic Quad Mesh Generation

نویسنده

  • Nilanjan Mukherjee
چکیده

“Bricolage”, a multidisciplinary term used extensively in visual arts, anthropology and cultural studies, refers to a creation that borrows elements from a diverse range of existing designs. The term is applied here to describe CSALF-Q, a new automatic 2D quad meshing algorithm that combines the strengths of recursive subdivision, loop-paving and transfinite interpolation to generate surface meshes that are anisotropic yet boundary structured, robust yet sensitive to size fields and competitive in performance. This algorithm is based on the understanding of boundary loops which are initially meshed recursively with a new, boundary based “loop-paving” technique that balances anisotropy and mesh quality. The remaining interior domain is filled out by a symbiotic process that shuttles between recursive subdivision, transfinite interpolation and loop-paving in an efficient manner. The mesh is finally cleaned and smoothed. Loop-fronts are classified and rule sets are defined for each, to aid optimum point placement. Stencils used for loop-closure are presented. Results are presented that compare both local and global element quality of meshes generated by the new algorithm with that of TQM (TriaQua Mesher) which is also known to handle variegated sizemaps.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Mesh Generation: Not Simple but Good

An improved algorithm for two-dimensional triangular mesh generation in arbitrary polygonally bounded domains with holes and isolated interior points is presented. The algorithm is quad-tree based and follows the ideas of Bern, Eppstein and Gilbert 1]. Using a rhomboid structure of the quad-tree and a number of new ideas for warping and centering points and for shifting grids, we are able to ge...

متن کامل

A Geometry-aware Data Partitioning Algorithm for Parallel Quad Mesh Generation on Large-scale 2D Regions

We develop a partitioning algorithm to decompose complex 2D data into small simple subregions for effective parallel quad meshing. We formulate the partitioning problem for effective parallel quad meshing as a quadratic integer optimization problem with linear constraints. Directly solving this problem is expensive for large-scale data partitioning. Hence, we suggest a more efficient two-step a...

متن کامل

A mesh generation procedure to simulate bimaterials

It is difficult to develop an algorithm which is able to generate the appropriate mesh around the interfaces in bimaterials. In this study, a corresponding algorithm is proposed for this class of unified structures made from different materials with arbitrary shapes. The non-uniform mesh is generated adaptively based on advancing front technique available in Abaqus software. Implementing severa...

متن کامل

Guaranteed-Quality Anisotropic Mesh Generation for Domains with Curves

Anisotropic mesh generation is important for interpolation and numerical modeling. Recently, Labelle and Shewchuk proposed a two dimensional guaranteedquality anisotropic mesh generation algorithm called Voronoi refinement. This algorithm treats only domains with straight lines as inputs. However, in many applications, input domains have many curves and the exact representation of curves is nee...

متن کامل

LayTracks: a new approach to automated geometry adaptive quadrilateral mesh generation using medial axis transform

A new mesh generation algorithm called ‘LayTracks’, to automatically generate an all quad mesh that is adapted to the variation of geometric feature size in the domain is described. LayTracks combines the merits of two popular direct techniques for quadrilateral mesh generation—quad meshing by decomposition and advancing front quad meshing. While the MAT has been used for the domain decompositi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011